Fast and Cost-Effective Online Load-Balancing in Distributed Range-Queriable Systems

Load Balancing in Distributed Systems

In Computer world Server load balancing is the process of distributing service requests across a group of servers. Users of one workstation are not hindered by the CPU intensive applications run on a different workstation. However, when a large number of machines in the network are idle, the efficiency of computation is decreased. The sharing of computing resources in a distributed system is a ...

Load Balancing in Distributed Systems

Distributed systems can be either connected computer or an array of single processor systems. The described method of speed performance, realized by load balancing procedures, can be used to both of these basic structures. By the application of genetic algorithms, using mutation as well as crossover, an optimal distribution mode is guaranteed.

PASS It ON (PASSION): An Adaptive Online Load-Balancing Algorithm for Distributed Range-Query Specialized Systems

Cost-Effective Data-Parallel Load Balancing

Load balancing algorithms improve a program’s performance on unbalanced datasets, but can degrade performance on balanced datasets, because unnecessary load redistributions occur. This paper presents a cost-effective data-parallel load balancing algorithm which performs load redistributions only when the possible savings outweigh the redistribution costs. Experiments with a data-parallelpolygon...

RAQ: A Range-Queriable Distributed Data Structure

Different structures are used in peer-to-peer networks to represent their inherently distributed, self-organized, and decentralized memory structure. In this paper, a simple range-queriable distributed data structure, called RAQ, is proposed to efficiently support exact match and range queries over multi-dimensional data. In RAQ, the key space is partitioned among the network with n nodes, in w...